 #include <iostream>
 #include <algorithm>
 #include <vector>
 using namespace std;
 
 vector<int> v;
 bool comp(const int &a, const int &b)
 {
     return a > b;
 }
 
 int main()
 {
   int t, n;
     for (scanf("%d", &t); t; t--)
    {
         v.clear();
         int a, sum = 0;
        scanf("%d", &n);
        for (int i = 0; i < n; i++)
        {
             scanf("%d", &a);
            v.push_back(a);
             sum += a;
         }
        if (sum % 2)
      {
             printf("no\n");
            continue;
         }

         int mark = 1;
        for (int i = 0; i < n; i++)
        {
            sort(v.begin(), v.end(), comp);
             if (v.size() - 1 < v[0])
             {
                 mark = 0;
                 break;
            }
             for (int j = 1; j <= v[0]; j++)
           {
                 v[j]--;
                 if (v[j] < 0)
                {
                     mark = -1;
                     break;
                }
            }
            if (mark == -1)
                break;
            v.erase(v.begin());
        }
        if (mark == 1)
            printf("yes\n");
        else 
            printf("no\n");
    }
}